Distinguishers for 4-Branch and 8-Branch Generalized Feistel Network
نویسندگان
چکیده
منابع مشابه
Quantum Cryptanalysis on Some Generalized Feistel Schemes
Post-quantum cryptography has attracted much attention from worldwide cryptologists. In ISIT 2010, Kuwakado and Morii gave a quantum distinguisher with polynomial time against 3-round Feistel networks. However, generalized Feistel schemes (GFS) have not been systematically investigated against quantum attacks. In this paper, we study the quantum distinguishers about some generalized Feistel sch...
متن کاملImproving Branch Prediction Performance with a Generalized Design for Dynamic Branch Predictors
Pipeling delays from conditional branches are major obstacles to achieving a high performance CPU. Precise branch prediction is required to overcome this performance limitation imposed on high performance architecture and is the key to many techniques for enhancing and exploiting Instruction-Level Parallelism (ILP). A generalized branch predictor is proposed in this paper. This predictor is a g...
متن کاملDistinguishers on Double-Branch Compression Function and Applications to Round-Reduced RIPEMD-128 and RIPEMD-160
or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper is prohibited and is subject to penalties under law. SUMMARY This paper presents differential-based distinguishers a...
متن کاملA generalized utility for parallel branch and bound algorithms
Branch and bound algorithms are general methods applied to various combinatorial optimization problems. Recently, parallelizations of these algorithms have been proposed. In spite of the generality of these methods, many of the parallelizations have been set up for a speciic problem and a speciic parallel computer. In this paper, a generalized utility PUBB (Parallel-ization Utility for Branch a...
متن کاملA branch and bound algorithm for the generalized assignment problem
This paper describes what is termed the "generalized assignment problem". It is a generalization of the ordinary assignment problem of linear programming in which multiple assignments of tasks to agents are limited by some resource available to the agents. A branch and bound algorithm is developed that solves the generalized assignment problem by solving a series of binary knapsack problems to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2017
ISSN: 2169-3536
DOI: 10.1109/access.2017.2688427